Random walks and an O*(n5) volume algorithm for convex bodies

نویسندگان

  • Ravi Kannan
  • László Lovász
  • Miklós Simonovits
چکیده

Abstract Given a high dimensional convex body K ⊆ IR by a separation oracle, we can approximate its volume with relative error ε, using O∗(n5) oracle calls. Our algorithm also brings the body into isotropic position. As all previous randomized volume algorithms, we use “rounding” followed by a multiphase Monte-Carlo (product estimator) technique. Both parts rely on sampling (generating random points in K), which is done by random walk. Our algorithm introduces three new ideas: • the use of the isotropic position (or at least an approximation of it) for rounding, • the separation of global obstructions (diameter) and local obstructions (boundary problems) for fast mixing, and • a stepwise interlacing of rounding and sampling.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks in a Convex Body and an Improved Volume Algorithm

We give a randomized algorithm using O(n7 log’ n ) separation calls to approximate the volume of a convex body with a fixed relative error. The bound is O(n6 log4 n ) for centrally symmetric bodies and for polytopes with a polynomial number of facets, and O(n5 log4 n ) for centrally symmetric polytopes with a polynomial number of facets. We also give an O(n6 log n ) algorithm to sample a point ...

متن کامل

Query by Committee, Linear Separation and Random Walks

Recent works have shown the advantage of using Active Learning methods, such as the Query by Committee (QBC) algorithm, to various learning problems. This class of Algorithms requires an oracle with the ability to randomly select a consistent hypothesis according to some predeened distribution. When trying to implement such an oracle, for the linear separators family of hypotheses, various prob...

متن کامل

Geometric Random Walks: A Survey∗

The developing theory of geometric random walks is outlined here. Three aspects — general methods for estimating convergence (the “mixing” rate), isoperimetric inequalities in Rn and their intimate connection to random walks, and algorithms for fundamental problems (volume computation and convex optimization) that are based on sampling by random walks — are discussed.

متن کامل

Blocking Conductance and Mixing in Random Walks

The notion of conductance introduced by Jerrum and Sinclair [8] has been widely used to prove rapid mixing of Markov Chains. Here we introduce a bound that extends this in two directions. First, instead of measuring the conductance of the worst subset of states, we bound the mixing time by a formula that can be thought of as a weighted average of the Jerrum-Sinclair bound (where the average is ...

متن کامل

Lecture 6 : Random Walks versus Independent Sampling

For many problems it is necessary to draw samples from some distribution D on a typically large set V . In order to do so, one often considers a Markov chain on V whose limiting distribution is D. The efficiency of the sampling algorithm requires the Markov chain to converge quickly. Two famous examples where this approach have been applied successfully are approximation algorithms for the perm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1997